منابع مشابه
Higher-order Abstract Syntax in Coq Higher-order Abstract Syntax in Coq
The terms of the simply-typed-calculus can be used to express the higher-order abstract syntax of objects such as logical formulas, proofs, and programs. Support for the manipulation of such objects is provided in several programming languages (e.g. Prolog, Elf). Such languages also provide embedded implication, a tool which is widely used for expressing hypothetical judgments in natural deduct...
متن کاملReflecting Higher-Order Abstract Syntax in Nuprl
This document describes part of an effort to achieve in Nuprl a practical reflection of its expression syntax. This reflection is done at the granularity of the operators; in particular, each operator of the syntax is denoted by another operator of the same syntax. Further, the syntax has binding operators, and we organize reflection not around the concrete binding syntax, but instead, around t...
متن کاملHigher-order Abstract Syntax in Type Theory
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool based on type theory (Coq). A language is specified by its signature, which consists of sets of sort and operation names and typing rules. These rules prescribe the sorts and bindings of each operation. An algebra of terms is associated to a signature, using de Bruijn n...
متن کاملPrimitive Recursion for Higher-Order Abstract Syntax
Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object language into variables in the meta-language. It leads to concise encodings, but is incompatible with functions defined by primitive recursion or proofs by induction. In this paper we propose an extension of the simply-typed lambda-calculus with iteration and case construc...
متن کاملSemantical Analysis of Higher-Order Abstract Syntax
It is the aim of this paper to advocate the use of functor categories as a semantic foundation of higher-order abstract syntax (HOAS). By way of example, we will show how functor categories can be used for at least the following applications: relating first-order and higher-order abstract syntax (proofs of adequacy) without using reduction rules, justifying induction principles and other axioms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1988
ISSN: 0362-1340,1558-1160
DOI: 10.1145/960116.54010